On-Line Bin Packing in Linear Time

Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electronics Program / N00014-79-C-0424Office of Naval Research / N00014-79C-0775National Science Foundation / MCS 81-07647 and NSF IST 80-12240IBM Graduate Fellowshi

Photoluminescence Properties of Two Closely Related Isostructural Series Based on Anderson-Evans Cluster Coordinated With Lanthanides [Ln(H2O)7{X(OH)6Mo6O18}]•yH2O, X = Al, Cr

The paper describes synthesis and structural characterization of the whole series of two closely related lanthanide coordinated chromium or aluminum hexamolybdates (Anderson-Evans cluster) including twelve new members hitherto unreported: [Ln(H2O)7{X(OH)6Mo6O18}]·4H2O and [Ln(H2O)7{X(OH)6Mo6O18}Ln(H2O)7]{X(OH)6Mo6O18}·16H2O where X = Al or Cr and Ln = La, Ce, Pr, Nd, Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb, Lu, and Y. Crystal structures of all the solids were established by powder and single crystal X-ray diffraction techniques. The two series are dictated by a different aggregation of the same set of molecular species: Lighter lanthanides favor coordination interaction between lanthanide ions and molybdate cluster forming 1D chains (Series I) while the heavier lanthanides result in the stacking of a cation, a pair of lanthanide hydrates coordinating to the cluster, and an anion, the discrete cluster is further stabilized through a large number of water molecules (Series II). Crystallization with Er3+ and Tm3+ ions results in a concomitant mixture of Series I and II. Photoluminescence of single crystals of all the chromium molybdates was dominated by a ruby-like emission including those which contain optically active ions Pr, Sm, Eu, Tb, Dy, and Tm. In contrast, aluminum analogs showed photoluminescence corresponding to characteristic lanthanide emissions. Our results strongly suggest a possible energy transfer from f levels of lanthanide ions to d levels of chromium (III) causing the quenching of lanthanide emission when coordinated with chromium molybdates. Intensity measurements showed that the emission from chromium molybdates are almost two orders of magnitude lower than naturally occurring ruby with broader line widths at room temperature

CONDITIONS FOR LOSSLESS JOIN

There is a well-known algorithm for determining when a decomposition ˆ {R 1, R 2,...,R m} of a database relation scheme has a lossless join with respect to a set of functional dependencies. We first present a reformulation of this algorithm in terms of set closures. For the special case of mˆ2, there is a well-known explicit condition for losslessness. Our formulation extends this result for general m. Also, our formulation leads to a strong necessary condition for to be lossless. Separately, we prove a sufficient condition for to be lossless. Finally, we present a sufficient condition, and a necessary condition for to be lossless with respect to a set of functional and multivalued dependencies

Topics in Combinatorial Algorithms

147 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1984.The study of algorithm design is of fundamental importance in Computer Science. The study of algorithms includes the study of efficient data structures. This thesis deals with various aspects of combinatorial algorithms and data structures.An important class of data structures, k-ary trees, is studied. A pair of k-ary tree traversals is used to assign a permutation of the integers 1,2,(' . . .) to each k-ary tree T. A pair of traversals in a k-ary tree Representation Scheme (k-RS), if it does not assign the same permutation to two distinct k-ary trees. Such pairs of traversals are characterized. Some interesting properties of k-RS are also studied.The computational complexity of a problem is of universal interest, both to algorithm design, and to an understanding of the nature of computation. New algorithms for the selection problem are presented and analyzed. The performance of these algorithms improve over that of previously known algorithms.The problem of finding the maximal elements of a set of n elements in E('d) is studied. The complexity of the problem as a function of both n, the number of points in the input set, and m, the number of maximal elements of the set, is studied.Finally, the aspect of NP-Completeness is considered. There are two main approaches that can be fruitful in dealing with NP-Complete problems. The first one is to find efficient algorithms for some special cases of the problem. This approach is followed for a personnel assignment problem. The general assignment problem is shown to be NP-Complete. Efficient algorithms are presented for some special cases of the problem.The second approach in dealing with NP-complete problems is to look for heuristic or approximation algorithms. This approach is followed for the one-dimensional bin packing problem. This problem has been studied extensively, and is known to be NP-Complete. New linear-time on-line approximation algorithms are presented for this problem. Their performance is better than that of previously known on-line algorithms. Also, the results extend to orthogonal packings in two dimension.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD

Covering Indexes for XML Queries: Bisimulation - Simulation = Negation

Tree Pattern Queries (TPQ), Branching Path Queries (BPQ), and Core XPath (CXPath) are subclasses of the XML query language XPath, TPQ XPath

Efficient provenance storage

As the world is increasingly networked and digitized, the data we store has more and more frequently been chopped, baked, diced and stewed. In consequence, there is an increasing need to store and manage provenance for each data item stored in a database, describing exactly where it came from, and what manipulations have been applied to it. Storage of the complete provenance of each data item can become prohibitively expensive. In this paper, we identify important properties of provenance that can be used to considerably reduce the amount of storage required. We identify three different techniques: a family of factorization processes and two methods based on inheritance, to decrease the amount of storage required for provenance. We have used the techniques described in this work to significantly reduce the provenance storage costs associated with constructing MiMI [22], a warehouse of data regarding protein interactions, as well as two provenance stores, Karma [31] and PReServ [20], produced through workflow execution. In these real provenance sets, we were able to reduce the size of the provenance by up to a factor of 20. Additionally, we show that this reduced store can be queried efficiently and further that incremental changes can be made inexpensively

Pathology of nasal mass lesions in a tertiary care center in Hyderabad, Telangana, India – A retrospective three years study

Background: The aim of the study was to identify the pattern of pathologies involving nasal mass lesions which were received for histopathological evaluation at a tertiary hospital in Hyderabad during the period January 2014 to December 2016. Methods: The data pertaining to samples of nasal mass lesions received for histopathological evaluation at the laboratory of a tertiary care hospital in Hyderabad from January 2014 to December 2016 were analyzed to determine the pattern of pathologies diagnosed during such evaluation and the age distribution of all lesions. Results: A total of 62 specimens labeled as nasal masses were received during the period studied. The majority of patients, whose samples were received, were in the age group of 21 – 30 years [35.48%], with very few patients from either extreme of age. Inflammatory nasal polyp was the most common histopathological diagnosis given [26 out of 62 cases, 41.93%] followed by allergic nasal polyp [19 out of 62 cases, 30.64%]. Only one lesion was diagnosed as malignant [squamous cell carcinoma] Conclusion: The majority of nasal mass lesions received for evaluation were inflammatory or else allergic nasal polyps. Most patients were in the third decade of life